منابع مشابه
Error-repair parsing schemata
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair parsing approaches achieve robustness by considering ungrammatical sentences as corrupted versions of valid sentences. In this article we present a deductive formalism, based on Sikkel’s parsing schemata, that can be ...
متن کاملParsing Schemata and Correctness of Parsing Algorithms
Parsing schemata provide a high level formal de scription of parsers These can be used among others as an intermediate level of abstraction for deriving the formal correctness of a parser A parser is correct if it duely implements a parsing schema that is known to be correct In this paper it is discussed how the correctness of a parsing schema can be proven and how pars ing schemata relate to s...
متن کاملError-repair Dependency Parsing for Ungrammatical Texts
We propose a new dependency parsing scheme which jointly parses a sentence and repairs grammatical errors by extending the non-directional transitionbased formalism of Goldberg and Elhadad (2010) with three additional actions: SUBSTITUTE, DELETE, INSERT. Because these actions may cause an infinite loop in derivation, we also introduce simple constraints that ensure the parser termination. We ev...
متن کاملA compiler for parsing schemata
We present a compiler which can be used to automatically obtain efficient Java implementations of parsing algorithms from formal specifications expressed as parsing schemata. The system performs an analysis of the inference rules in the input schemata in order to determine the best data structures and indexes to use, and ensure that the generated implementations are efficient. The system descri...
متن کاملDependency Parsing Schemata and Mildly Non-Projective Dependency Parsing
We introduce dependency parsing schemata, a formal framework based on Sikkel’s parsing schemata for constituency parsers, which can be used to describe, analyze, and compare dependency parsing algorithms. We use this framework to describe several well-known projective and non-projective dependency parsers, build correctness proofs, and establish formal relationships between them. We then use th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.12.007